Decision Problems for Finitely Presented and One-Relation Semigroups and Monoids
نویسندگان
چکیده
For some distinguished properties of semigroups, such as having idempotents, regularity, hopficity etc, we study the following: whether that property or its negation is a Markov property, whether it is decidable for finitely presented semigroups and for one-relation semigroups and monoids. All the results and open problems are summarized in a table.
منابع مشابه
Small Overlap Monoids Ii: Automatic Structures and Normal Forms
We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular language of normal forms, and that these normal forms can be computed in linear time. We also deduce that C(4) monoids and semigroups are rational (in the sense...
متن کاملMarkov semigroups, monoids, and groups
A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown...
متن کاملPrincipal Ideals of Finitely Generated Commutative Monoids
We study the semigroups isomorphic to principal ideals of finitely generated commutative monoids. We define the concept of finite presentation for this kind of semigroups. Furthermore, we show how to obtain information on these semigroups from their presentations.
متن کاملOn Regularity of Acts
In this article we give a characterization of monoids for which torsion freeness, ((principal) weak, strong) flatness, equalizer flatness or Condition (E) of finitely generated and (mono) cyclic acts and Condition (P) of finitely generated and cyclic acts implies regularity. A characterization of monoids for which all (finitely generated, (mono) cyclic acts are regular will be given too. We als...
متن کاملOn finitely related semigroups
An algebraic structure is finitely related (has finite degree) if its term functions are determined by some finite set of finitary relations. We show that the following finite semigroups are finitely related: commutative semigroups, 3-nilpotent monoids, regular bands, semigroups with a single idempotent, and Clifford semigroups. Further we provide the first example of a semigroup that is not fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJAC
دوره 19 شماره
صفحات -
تاریخ انتشار 2009